Inside Fred B. Schneider On Concurrent Programming oncurrent programs are notoriously difficult to get right. This is as true today as it was 30 years ago. But

Source URL: www.cs.cornell.edu

• Concurrent computing
• E
• Java
• Computer program
• Parallel computing
• Software bug
• Computing
• Software engineering
• Computer programming

Enforceable Security Policies FRED B. SCHNEIDER Cornell University A precise characterization is given for the class of security policies enforceable with mechanisms that work by monitoring system execution, and automata

Source URL: www.cs.cornell.edu

• Formal methods
• Security
• Büchi automaton
• Computer security
• State
• Security policy
• Kernel
• Finite-state machine
• Models of computation
• Automata theory
• Theoretical computer science

Optimal Primary-Backup Protocols Navin Budhiraja*, Keith Marzullo*, Fred B. Schneider**, Sam Toueg*** Department of Computer Science, Cornell University, Ithaca NY 14853, USA A b s t r a c t . We give primary-backup prot

Source URL: www.cs.cornell.edu

Using Message Passing for Distributed Programming: Proof Rules and Disciplines RICHARD D. SCHLICHTING University of Arizona FRED B. SCHNEIDER

Source URL: www.cs.cornell.edu

• Data
• Communicating sequential processes
• Concurrent computing
• Axiom
• Communications protocol
• Program logic
• Computing
• Process calculi
• Software

2010 23rd IEEE Computer Security Foundations Symposium Quantification of Integrity Michael R. Clarkson Fred B. Schneider Department of Computer Science Cornell University

Source URL: www.cs.cornell.edu

• Science
• Telecommunications engineering
• Communication
• Information Age
• Output
• Noisy-channel coding theorem
• Channel
• Kullback–Leibler divergence
• Information theory
• Information
• Cybernetics

What Tacoma Taught Us Dag Johansen y Fred B. Schneider

Source URL: www.cs.cornell.edu

• Tacoma
• Washington
• Server
• X Window System
• Denial-of-service attack
• Host
• Software
• Computing
• System software

Belief in Information Flow Michael R. Clarkson Andrew C. Myers Fred B. Schneider Department of Computer Science Cornell University {clarkson,andru,fbs}@cs.cornell.edu Abstract

Source URL: www.cs.cornell.edu

• Symbol
• Model theory
• Independence
• Structure
• Measure
• Logic
• Probability theory
• Statistical dependence
• Mathematics

Equational Propositional Logic David Gries 1 and Fred B. Schneider 2 Computer Science, Cornell University September[removed]Abstract

Source URL: www.cs.cornell.edu

• Propositional calculus
• Rules of inference
• Boolean algebra
• Philosophical logic
• Equational logic
• First-order logic
• Mathematical proof
• Modal logic
• Modus ponens
• Logic
• Mathematics
• Mathematical logic

Formalizations Of Substitution Of Equals For Equals David Gries and Fred B. Schneider y Computer Science Department, Cornell University Ithaca, New York[removed]USA May 27, 1998

Source URL: www.cs.cornell.edu

• Propositional calculus
• Predicate logic
• Model theory
• Quantification
• First-order logic
• Function
• Generalization
• Universal quantification
• Modal logic
• Logic
• Mathematical logic
• Mathematics

The "Hoare Logic" of CSP, and All That LESLIE LAMPORT SRI International and FRED B. SCHNEIDER Cornell University

Source URL: www.cs.cornell.edu

• Program logic
• Concurrent computing
• Hoare logic
• Logic programming
• Communicating sequential processes
• Modal logic
• KeY
• Guarded Command Language
• Well-formed formula
• Logic
• Theoretical computer science
• Mathematics